Crepe Yarns-Their Diameters and Structures
نویسندگان
چکیده
منابع مشابه
CRePE: Context-Related Policy Enforcement for Android
Most of the research work for enforcing security policies on smartphones considered coarse-grained policies, e.g. either to allow an application to run or not. In this paper we present CRePE, the first system that is able to enforce fine-grained policies, e.g. that vary while an application is running, that also depend on the context of the smartphone. A context can be defined by the status of ...
متن کاملCREPE: A Convolutional Representation for Pitch Estimation
The task of estimating the fundamental frequency of a monophonic sound recording, also known as pitch tracking, is fundamental to audio processing with multiple applications in speech processing and music information retrieval. To date, the best performing techniques, such as the pYIN algorithm, are based on a combination of DSP pipelines and heuristics. While such techniques perform very well ...
متن کاملNew Environment CREPE for Transportation Control and its Effectiveness
This paper discusses the control scheme for vehicle control for a future integrated transportation system forming a type of new generation of Intelligent Transportation SystemITS. The approach generally is focuses on the mechanisms for how to detect or estimate incidents on roads and to then communicate the information to each vehicle. The individual vehicular data is collected by using the Glo...
متن کاملOphthalmoscopic-Perspectively Distorted Optic Disc Diameters and Real Disc Diameters.
PURPOSE To investigate the difference between two-dimensionally measured disc diameters (DDs) based on fundus images and three-dimensionally measured DDs based on enhanced depth imaging optical coherence tomography (EDI-OCT). METHODS The DDs were three-dimensionally measured on EDI-OCT images of optic nerve heads and two-dimensionally measured on near-infrared reflectance fundus images in 90 ...
متن کاملDiameters and Eigenvalues
We derive a new upper bound for the diameter of a k-regular graphG as a function of the eigenvalues of the adjacency matrix. Namely, supposethe adjacency matrix of G has eigenvalues AI , A2 .••.• An with lAd:::: IA21 ::::... :::: IAnl where AI = k, A = IA21. Then the diameter D(G) must satisfy D(G) :::; rlog(n 1)f1og(k/A)l. We wilJ consider families of graphs whose eigenvalues can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Textile Machinery Society of Japan
سال: 1959
ISSN: 0040-5043,1881-1159
DOI: 10.4188/jte1955.5.2_42